On dynamic programming with unbounded returns
نویسندگان
چکیده
منابع مشابه
Dynamic-Programming-Based Inequalities for the Unbounded Integer Knapsack Problem
We propose a new hybrid approach to solve the unbounded integer knapsack problem (UKP), where valid inequalities are generated based on intermediate solutions of an equivalent forward dynamic programming formulation. These inequalities help tighten the initial LP relaxation of the UKP, and therefore improve the overall computational efficiency. We also extended this approach to solve the multi-...
متن کاملEecient Dynamic Programming for the Unbounded Knapsack Problem
We present an eecient implementation of the dynamic programming algorithm for the unbounded knapsack problem, a classic NP-hard combinatorial optimization problem. We use four important techniques to obtain the improvements: (i) the notion of maximal dominance between the object types; the ideas of (ii) periodicity; and (iii) sparsity; and (iv) the design of a new hybrid recurrence equation tha...
متن کاملRecursive utility and optimal growth with bounded or unbounded returns
In this paper we propose a unifying approach to the study of recursive economic problems. Postulating an aggregator function as the fundamental expression of tastes, we explore conditions under which a utility function can be constructed. We also modify the usual dynamic programming arguments to include this class of models. We show that Bellman’s equation still holds, so many results known for...
متن کاملReturn-Oriented Programming without Returns on ARM
In this paper we present a novel and general memory-related attack method on ARM-based computing platforms. Our attack deploys the principles of return-oriented programming (ROP), however, in contrast to conventional ROP, it exploits jumps instead of returns, and hence it can not be detected by return address checkers. Although a similar attack has been recently proposed for Intel x86, it was u...
متن کاملA Weak Dynamic Programming Principle for Zero-Sum Stochastic Differential Games with Unbounded Controls
We analyze a zero-sum stochastic differential game between two competing players who can choose unbounded controls. The payoffs of the game are defined through backward stochastic differential equations. We prove that each player’s priority value satisfies a weak dynamic programming principle and thus solves the associated fully non-linear partial differential equation in the viscosity sense.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Economic Theory
سال: 2000
ISSN: 0938-2259,1432-0479
DOI: 10.1007/s001990050016